Queue-Length Distributions for Multi-Priority Queueing Systems
نویسندگان
چکیده
The bottleneck in many telecommunication systems has often been modeled by an M/G/1 queueing system with priorities. While the probability generating function for the occupancy distribution of each traffic classes can be readily obtained, the occupancy distributions have been obtainable only rarely. However, the occupancy distribution is of great importance, particularly in those cases where the moments are not all finite. We present a method of obtaining the occupancy distribution from the PGF and demonstrate its validity by obtaining the occupancy distributions for a number of cases, including those with regularly varying service time distributions.
منابع مشابه
Approximate Analysis of General Priority Queues
The present paper deals with the problem of calculating queue length distributions in a priority queueing model with a preemptive-resume policy under the assumption of general arrival and service distributions. The multi-queue priority system is decomposed into single-queue vacation systems, for which the visit and inter-visit distributions are approximated by the idle and busy period of a ΣGI/...
متن کاملAnalysis of a Two-class Priority Queue with Bernoulli Schedules
A Bernoulli schedule is random service discipline for a multi-class priority queueing system which operates as follows: If queue i(l :s i :s N) is not empty just after servicing a message in its queue, a message in queue i is served again with probability Pi, and the highest class message present in the system is served with probability 1-Pi, where 0 :s Pi :s 1. This paper presents an analysis ...
متن کاملPacket Models Revisited: Tandem and Priority Systems
We examine two extensions of traditional single-node packet-scale queueing models: tandem networks and (strict) priority systems. Two generic input processes are considered: periodic and Poisson arrivals. For the two-node tandem, an exact expression is derived for the joint distribution of the total queue length, and the queue length of the first queue, implicitly determining the distribution o...
متن کاملA Unified Method to Analyze Overtake Free Queueing Systems
In this paper we demonstrate that the distributional laws that relate the number of customers in the system (queue), L(Q) and the time a customer spends in the system (queue), S(W) under the first-in-first-out (FIFO) discipline are special cases of the H = AG law and lead to a complete solution for the distributions of L, Q, S, W for queueing systems which satisfy distributional aws for both L ...
متن کاملMixed gated/exhaustive service in a polling model with priorities
In this paper we consider a single-server polling system with switch-over times. We introduce a new service discipline, mixed gated/exhaustive service, that can be used for queues with two types of customers: high and low priority customers. At the beginning of a visit of the server to such a queue, a gate is set behind all customers. High priority customers receive priority in the sense that t...
متن کامل